An optimal algorithm for 2-bounded delay buffer management with lookahead

The bounded delay buffer management problem, which was proposed by Kesselman et al. (STOC 2001 and SIAM Journal on Computing 33(3), 2004), is an online problem focusing of a switch supporting Quality Service (QoS). definition as follows: Packets arrive to over time each packet specified the release time, deadline value. An algorithm can transmit at most one from integer gain its value profit if transmitting after time. objective this maximize gained profit. We say that instance s-bounded for any packet, has s chances it. For s≥2, Hajek (CISS 2001) showed competitive ratio deterministic least (1+5)/2≥1.618. Recently, Veselý (SODA 2019) designed matching lower bound. Böhm (ISAAC 2016 Theoretical Computer Science, introduced lookahead ability algorithm. At t, obtains information about packets arriving t+1, s=2, there achieves (−1+13)/2≤1.303. Also, they (1+17)/4≥1.280. In paper, 2-bounded model with lookahead, we design (1+17)/4.